Generate large prime numbers using boost library
Recently I am working on a RSA like algorithm project, which needs to generate large secret prime numbers, e.g. 512 bits, or 1024 bits. Luckily we are using boost library, which is inbuilt lots of functions to assist this generation. #include <boost/multiprecision/miller_rabin.hpp> #include <boost/random/mersenne_twister.hpp> using namespace boost::multiprecision; using namespace boost::random; … //Generate a secret RSA-like 512 … Continue reading Generate large prime numbers using boost library
Copy and paste this URL into your WordPress site to embed
Copy and paste this code into your site to embed